On Sum–Connectivity Index of Bicyclic Graphs
نویسندگان
چکیده
We determine the minimum sum–connectivity index of bicyclic graphs with n vertices and matching number m, where 2 ≤ m ≤ ⌊n2 ⌋, the minimum and the second minimum, as well as the maximum and the second maximum sum–connectivity indices of bicyclic graphs with n ≥ 5 vertices. The extremal graphs are characterized. MSC 2000: 05C90; 05C35; 05C07
منابع مشابه
On the harmonic index of bicyclic graphs
The harmonic index of a graph $G$, denoted by $H(G)$, is defined asthe sum of weights $2/[d(u)+d(v)]$ over all edges $uv$ of $G$, where$d(u)$ denotes the degree of a vertex $u$. Hu and Zhou [Y. Hu and X. Zhou, WSEAS Trans. Math. {bf 12} (2013) 716--726] proved that for any bicyclic graph $G$ of order $ngeq 4$, $H(G)le frac{n}{2}-frac{1}{15}$ and characterize all extremal bicyclic graphs.In this...
متن کاملA note on polyomino chains with extremum general sum-connectivity index
The general sum-connectivity index of a graph $G$ is defined as $chi_{alpha}(G)= sum_{uvin E(G)} (d_u + d_{v})^{alpha}$ where $d_{u}$ is degree of the vertex $uin V(G)$, $alpha$ is a real number different from $0$ and $uv$ is the edge connecting the vertices $u,v$. In this note, the problem of characterizing the graphs having extremum $chi_{alpha}$ values from a certain collection of polyomino ...
متن کاملBicyclic Graphs with Minimum General Sum-connectivity Index
Du, Zhou and Trinajstić [J. Math. Chem., 48, pp. 697–703, 2010] proved that in the set of n-vertex connected unicyclic graphs G with n ≥ 3, for –1 ≤ α < 0, the graph consisting of a triangle and n – 3 pendant vertices adjacent to the same vertex of this triangle is the unique graph with the minimum general sum-connectivity index. In this paper, using a graph transformation and several inequalit...
متن کاملExtremal Results concerning the General Sum-connectivity Index in Some Classes of Connected Graphs
This paper surveys extremal properties of general sum-connectivity index χα(G) in several classes of connected graphs of given order for some values of the parameter α: a) trees; b) connected unicyclic or bicyclic graphs; c) graphs of given connectivity. Work presented as invited lecture at CAIM 2014, September 19-22, “Vasile Alecsandri” University of Bacău, Romania.
متن کاملExtremal Unicyclic and Bicyclic Graphs with Respect to Harary Index
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this paper, we determined the extremal (maximal and minimal) unicyclic and bicyclic graphs with respect to Harary index. 2010 Mathematics Subject Classification: 05C90
متن کامل